Model Theory of Wkl

نویسندگان

  • Richard Kaye
  • Roman Kossak
  • Alexander Kreuzer
  • Neil Thapen
  • Yue Yang
  • Keita Yokoyama
چکیده

We develop machinery to make the Arithmetized Completeness Theorem more effective in the study of many models of I∆0 + BΣ1 + exp, including all countable ones, by passing on to the conservative extension WKL0 of I∆0+BΣ1+exp. Our detailed study of the model theory of WKL ∗ 0 also leads to the simplification and improvement of many results in the model theory of Peano arithmetic and its fragments. Here we concentrate on end extensions and self-embeddings of models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Feasible Theory for Analysis

We construct a weak second-order theory of arithmetic which includes Weak König’s Lemma (WKL) for trees defined by bounded formulae. The provably total functions (with Σ1-graphs) of this theory are the polynomial time computable functions. It is shown that the first-order strength of this version of WKL is exactly that of the scheme of collection for bounded formulae.

متن کامل

Another Unique Weak König’s Lemma Wkl!!

In [2] J. Berger and Ishihara proved, via a circle of informal implications involving countable choice, that Brouwer’s Fan Theorem for detachable bars on the binary fan is equivalent in Bishop’s sense to various principles including a version WKL! of Weak König’s Lemma with a strong effective uniqueness hypothesis. Schwichtenberg [9] proved the equivalence directly and formalized his proof in M...

متن کامل

First- and Second-Order Models of Recursive Arithmetics

We study a quadruple of interrelated subexponential subsystems of arithmetic WKL 0 , RCA 0 , IΔ0, and ΔRA1, which complement the similarly related quadruple WKL0, RCA0, IΣ1, and PRA studied by Simpson, and the quadruple WKL 0 , RCA 0 , IΔ0(exp), and EFA studied by Simpson and Smith. We then explore the space of subexponential arithmetic theories between IΔ0 and IΔ0(exp). We introduce and study ...

متن کامل

ERNA and Friedman's Reverse Mathematics

Elementary Recursive Nonstandard Analysis, in short ERNA, is a constructive system of nonstandard analysis with a PRA consistency proof, proposed around 1995 by Patrick Suppes and Richard Sommer. Recently, the author showed the consistency of ERNA with several transfer principles and proved results of nonstandard analysis in the resulting theories (see [12] and [13]). Here, we show that Weak Kö...

متن کامل

A four-state Markov model of sleep-wakefulness dynamics along light/dark cycle in mice

Behavioral states alternate between wakefulness (wk), rapid eye movement (rem) and non-rem (nrem) sleep at time scale of hours i.e., light and dark cycle rhythms and from several tens of minutes to seconds (i.e., brief awakenings during sleep). Using statistical analysis of bout duration, Markov chains of sleep-wk dynamics and quantitative EEG analysis, we evaluated the influence of light/dark ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015